Smooth Uniform Crossover, Sub-Machine Code GP and Demes: A Recipe For Solving High-Order Boolean Parity Problems
نویسندگان
چکیده
We describe a recipe to solve very large parity problems using GP. The recipe includes: smooth uniform crossover (a crossover operator inspired by our theoretical research), sub-machine-code GP (a technique to speed up fitness evaluation in Boolean classification problems), and interacting demes (sub-populations) running on separate workstations. We tested this recipe on parity problems with up to 22 input variables, solving them with a very high success probability.
منابع مشابه
Solving High - Order Boolean Parity Problems
We propose and study new search operators and a novel node representation that can make GP tness landscapes smoother. Together with a tree evaluation method known as sub-machine code GP and the use of demes, these make up a recipe for solving very large parity problems using GP. We tested this recipe on parity problems with up to 22 input variables, solving them with a very high success probabi...
متن کاملSub-machine-code Genetic Programming
CPUs are often seen as sequential, however they have a high degree of internal parallelism, typically operating on 32 or 64 bits simultaneously. This paper explores the idea of exploiting this internal parallelism to extend the scope of genetic programming (GP) and improve its eeciency. We call the resulting form of GP sub-machine-code GP. The diierences between sub-machine-code GP and the usua...
متن کاملSmooth Uniform Crossover with Smooth Point Mutation in Genetic Programming: A Preliminary Study
In this paper we examine the behaviour of the uniform crossover and point mutation GP operators 12] on the even-n-parity problem for n = 3; 4; 6 and present a novel representation of function nodes, designed to allow the search operators to make smaller movements around the solution space. Using this representation, performance on the even-6-parity problem is improved by three orders of magnitu...
متن کاملTabu Programming Method: A New Meta-Heuristics Algorithm Using Tree Data Structures for Problem Solving
The core of artificial intelligence and machine learning is to get computers to solve problems automatically. One of the great tools that attempt to achieve that goal is Genetic Programming (GP). GP is a generalization procedure of the well-known meta-heuristic of Genetic Algorithms (GAs). Meta-heuristics have shown successful performance in solving many combinatorial search problems. In this p...
متن کاملFinding General Solutions to the Parity Problem by Evolving Machine-Language Representations
Evolutionary search on a machinelanguage program representation is used to nd exact and general solutions to the bit-counting problem|abstractly, given a set B of boolean variables, compute the number of variables in B with value true. Solutions to the bit-counting problem directly solve the parity problem that decides whether the number of true variables in B is even or odd. Our virtual machin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999